package 笔试题;

/**
 * https://leetcode.cn/problems/escape-the-spreading-fire/?envType=daily-question&envId=2023-11-09
 */

public class lk_1334阈值距离内邻居最少的城市 {
    public static void main(String[] args) {
        lk_1334阈值距离内邻居最少的城市 m = new lk_1334阈值距离内邻居最少的城市();

//        m.findTheCity()
    }
    public int findTheCity(int n, int[][] edges, int distanceThreshold) {
        int[] res = new int[n];
        int re = -1;
        int[][] ty = new int[n][n];
        for (int i=0;i<edges.length;i++){
            if(edges[i][2] <= distanceThreshold){
                ty[edges[i][0]][edges[i][1]] = edges[i][2];
                ty[edges[i][1]][edges[i][0]] = edges[i][2];
            }
        }
        int[] zz = new int[n];
        for (int i = 0; i < n; i++) {
            int k = distanceThreshold;
            for (int j = 0; j < n; j++) {
                if(i!=j && ty[i][j]>0){

                }
            }
        }

        return re;
    }
}

